Fundamental Limits of Blind Deconvolution Part II: Sparsity-Ambiguity Trade-offs

نویسندگان

  • Sunav Choudhary
  • Urbashi Mitra
چکیده

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed since signal identifiability is a key concern, and there have been efforts to use sparse models for regularizing blind deconvolution to promote signal identifiability. Part I of this two-part paper establishes a measure theoretically tight characterization of the ambiguity space for blind deconvolution and unidentifiability of this inverse problem under unconstrained inputs. Part II of this paper analyzes the identifiability of the canonical-sparse blind deconvolution problem and establishes surprisingly strong negative results on the sparsity-ambiguity trade-off scaling laws. Specifically, the ill-posedness of canonical-sparse blind deconvolution is quantified by exemplifying the dimension of the unidentifiable signal sets. An important conclusion of the paper is that canonical sparsity occurring naturally in applications is insufficient and that coding is necessary for signal identifiability in blind deconvolution. The methods developed herein are applied to a second-hop channel estimation problem to show that a family of subspace coded signals (including repetition coding and geometrically decaying signals) are unidentifiable under blind deconvolution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fundamental Limits of Blind Deconvolution Part I: Ambiguity Kernel

Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing. This problem is generally ill-posed, and there have been efforts to use sparse models for regularizing blind deconvolution to promote signal identifiability. Part I of this two-part paper characterizes the ambiguity space of blind deconvolution and shows unidentifia...

متن کامل

A Uni ed Framework for Identi ability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models∗

Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some s...

متن کامل

Identifiability in Blind Deconvolution under Minimal Assumptions

Blind deconvolution (BD) arises in many applications. Without assumptions on the signal and the filter, BD is ill-posed. In practice, subspace or sparsity assumptions have shown the ability to reduce the search space and yield the unique solution. However, existing theoretical analysis on uniqueness in BD is rather limited. In an earlier paper of ours [1], we provided the first algebraic sample...

متن کامل

A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models

Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some s...

متن کامل

Blind Deconvolution with Re-weighted Sparsity Promotion

Blind deconvolution has made significant progress in the past decade. Most successful algorithms are classified either as Variational or Maximum a-Posteriori (MAP ). In spite of the superior theoretical justification of variational techniques, carefully constructed MAP algorithms have proven equally effective in practice. In this paper, we show that all successful MAP and variational algorithms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1503.03184  شماره 

صفحات  -

تاریخ انتشار 2015